Elementary Algorithms Analysis of Megrelishvili Protocol

Elementary average case analysis of Floyd's algorithms to construct heaps

Realizing Elementary Clonal Selection Algorithms

A series of acquired immunity inspired clonal selection models have previously been proposed that includes principle model components and base (single repertoire) models. Also previously proposed is a contrived problem domain called ‘colour space’ and a number of scenarios intended for the investigation of adaptive models. This work units these two (until now) isolated streams of work by realiz...

Elementary algebra revisited: Randomized algorithms

We look at some simple algorithms for elementary problems in algebra that yield dramatic efficiency improvements over standard methods through randomization. The randomized algorithms are, in a sense, “obvious”. Their formal statement was delayed partly by the need for rigorous analysis, but more so by the need to re-think traditional approaches to elementary algorithms. We illustrate this phil...

woman-defined identity: analysis of selected poems of adrienne rich

the current thesis is composed in five chapters in the following fashion: chapter two encompasses the applied framework of the project in details; the methodology of carl gustav jung to explain the process of individuation, the major archetypes and their attributes and his techniques to assess the mind’s strata are all explained. moreover, the austrian psychoanalysts, heinz kohut’s models of a...

An Analysis of Path-Vector Routing Protocol Convergence Algorithms

Today’s Internet uses a path vector routing protocol, BGP, for global routing. After a connectivity change, a path vector protocol tends to explore a potentially large number of alternative paths before converging on new stable paths. Several techniques for improving path vector convergence have been proposed, however there has been no comparative analysis to judge the relative merit of each ap...